Efficient Algorithms for Scheduling and Mapping of Parallel Programs onto Parallel Architectures

Authorisation I hereby declare that I am the sole author of the thesis. I authorise the Hong Kong University of Science and Technology to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorise the Hong Kong University of Science and Technology to reproduce the thesis by photocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research.-iv-Acknowledgements I would like to sincerely thank my advisor, Dr. Ishfaq Ahmad, for his patience, guidance and invaluable advice on my studies. I am very grateful for his continual support on both academic and personal problems. I am most grateful to my wife, Fyon, for her love and patience that keeps me working whenever I am frustrated. Without the encouragements from Dr. Ahmad and Fyon, it could have been difficult to continue my graduate studies. on the CASCH project and I thank them for their precious contributions. I would like to acknowledge the Hong Kong Research Grants Council for supporting this work (under contract number HKUST 179/93E). Finally, I thank the Computer Science Department for its generosity in providing a nice and convenient work environment for its graduate students. I hope that the department will continue to do so in the future. Figure 1.2 : (a) A taxonomy of the approaches to the scheduling problem; (b) A task interaction graph; (c) A task precedence graph.. Figure 2.1 : (a) A simple tree-structured task graph with unit-cost tasks and without communication among tasks; (b) The optimal schedule of the task graph Figure 2.2 : (a) A simple task graph with unit-cost tasks and without communication among tasks; (b) The optimal schedule of the task graph in a two-processor Figure 2.3 : (a) A task graph; (b) The schedule generated by the HLFET algorithm (schedule length = 43 time units); (c) The best possible schedule (schedule length = 34 time units). Figure 2.6 : (a) A randomly generated task graph; (b) An initial schedule without duplication (schedule length = 299 time units); (c) The final schedule produced by the DSH algorithm (schedule length = 275 time units); (d) An intermediate schedule in which the duplication of n 2 increases the start times of n 3 and n 5 ; (e) The final schedule produced by the BTDH algorithm Figure 2.7 : (a) A simple task …